Unimodality and Log-Concavity of Polynomials
نویسندگان
چکیده
A polynomial is unimodal if its sequence of coefficients are increasing up to an index, and then are decreasing after that index. A polynomial is logconcave if the sequence of the logarithms of the coefficients is concave. We prove that if P (x) is a polynomial with nonnegative non-decreasing coefficients then P (x+z) is unimodal for any natural z. Furthermore, we prove that if P (x) is a log-concave polynomial with nonnegative coefficients and no internal zeroes, then for any natural number n, P (x+n) is log-concave. Unimodal polynomials whose coefficients satisfy certain criteria are shown to be log-concave. An open problem in proving a particular polynomial is log-concave is discussed. We prove that if a unimodal polynomial Q(x) satisfies certain conditions, then Q(x− 1) has nonnegative nondecreasing coefficients.
منابع مشابه
The unimodality of independence polynomials of some graphs
In this paper we study unimodality problems for the independence polynomial of a graph, including unimodality, log-concavity and reality of zeros. We establish recurrence relations and give factorizations of independence polynomials for certain classes of graphs. As applications we settle some unimodality conjectures and problems. © 2010 Elsevier Ltd. All rights reserved.
متن کاملLog-concavity of Stirling Numbers and Unimodality of Stirling Distributions
A series of inequalities involving Stirling numbers of the first and second kinds with adjacent indices are obtained. Some of them show log-concavity of Stirling numbers in three different directions. The inequalities are used to prove unimodality or strong unimodality of all the subfamilies of Stirling probability functions. Some additional applications are also presented.
متن کامل2 9 Se p 20 13 Operations of graphs and unimodality of independence polynomials ∗
Given two graphs G and H, assume that C = {C1, C2, . . . , Cq} is a clique cover of G and U is a subset of V (H). We introduce a new graph operation called the clique cover product, denoted by G ⋆ HU , as follows: for each clique Ci ∈ C , add a copy of the graph H and join every vertex of Ci to every vertex of U . We prove that the independence polynomial of G ⋆ HU I(G ⋆ H ;x) = I(H;x)I(G; xI(H...
متن کاملThe proof of a conjecture of Simion for certain partitions
Simion has a conjecture concerning the number of lattice paths in a rectangular grid with the Ferrer's diagram of a partition removed. The conjecture concerns the unimodality of this number over a sequence of rectangles with the sum of the length and width being constant and with a constant partition. This paper demonstrates this unimodality if the partition is symmetric or if the Ferrer's diag...
متن کاملRIMS - 1824 Rigged Configurations and Catalan , Stretched Parabolic Kostka
We will look at the Catalan numbers from the Rigged Configurations point of view originated [9] from an combinatorial analysis of the Bethe Ansatz Equations associated with the higher spin anisotropic Heisenberg models . Our strategy is to take a combinatorial interpretation of Catalan numbers Cn as the number of standard Young tableaux of rectangular shape (n2), or equivalently, as the Kostka ...
متن کامل